Game-based modeling of independent searchers who share a common goal

Abstract We develop a mathematical model of the performance group independent Bayesian searchers who are all seeking common goal. In this context, do not directly interact with one another, but they may observe behavior nearby and adjust their accordingly. By modeling system as an evolutionary game, evolutionarily stable strategy is found for percentage time that given searcher should bias its towards others vice when it follow own instincts. The dependence value equilibrium on size determined. Numerical simulation experiments demonstrate validity analytical results. article concludes numerical assessment robustness to small number deviating searchers, is, adopt alternative following strategy.